A Sandwich Proof of the Shannon-McMillan-Breiman Theorem
نویسندگان
چکیده
منابع مشابه
A Bilateral Version of the Shannon-McMillan-Breiman Theorem
We give a new version of the Shannon-McMillan-Breiman theorem in the case of a bijective action. For a finite partition α of a compact set X and a measurable action T on X, we denote by CT n,m,α(x) the element of the partition α ∨ T 1α ∨ . . . ∨ Tmα ∨ T−1α ∨ . . . ∨ T−nα which contains a point x. We prove that for μ-almost all x, lim n+m→∞ ( −1 n+m ) logμ(C n,m,α(x)) = hμ(T, α), where μ is a T ...
متن کاملA Bilateral version of Shannon-Breiman-McMillan Theorem
We give a new version of the Shannon-McMillan-Breiman theorem in the case of a bijective action. For a finite partition α of a compact set X and a measurable action T on X, we denote by C n,m,α(x) the element of the partition α ∨ T 1α ∨ . . . ∨ Tα ∨ T−1α ∨ . . . ∨ Tα which contains a point x. We prove that for μ-almost all x, lim n+m→∞ (
متن کاملEntropy and the Shannon-McMillan-Breiman Theorem for Beta Random Matrix Ensembles
We show that beta ensembles in Random Matrix Theory with generic real analytic potential have the asymptotic equipartition property. In addition, we prove a Central Limit Theorem for the density of the eigenvalues of these ensembles.
متن کاملA Bilateral Version of the Shannon-McMillan-Breiman Theorem and an application to cellular automata entropy calculation
We give a version of the Shannon-McMillan-Breiman theorem in the case of a bijective action. For a finite partition α of a compact set X and a measurable action T on X, we denote by CT n,m,α(x) the element of the partition α ∨ T 1α ∨ . . . ∨ Tmα ∨ T−1α ∨ . . . ∨ T−nα which contains a point x. We prove that for μ-almost all x, lim n+m→∞ ( −1 n+m ) logμ(C n,m,α(x)) = hμ(T, α), where μ is a T -erg...
متن کاملThe Shannon-McMillan Theorem for Ergodic Quantum Lattice Systems
We formulate and prove a quantum Shannon-McMillan theorem. The theorem demonstrates the significance of the von Neumann entropy for translation invariant ergodic quantum spin systems on Z-lattices: the entropy gives the logarithm of the essential number of eigenvectors of the system on large boxes. The one-dimensional case covers quantum information sources and is basic for coding theorems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1988
ISSN: 0091-1798
DOI: 10.1214/aop/1176991794